The chord version for SONET ADMs minimization

The chord version for SONET ADMs minimization

We consider a problem which arises in optical routing. WDM/SONET rings are a network architecture used by telecommunications carriers for traffic streams. The dominant cost factor in such networks is the total number of add-drop multiplexers (ADMs) used. A list of traffic streams to be routed between pairs of nodes is given. In this paper we consider the problem where we need to assign a route ...

Better Bounds for Minimizing SONET ADMs

SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total nu...

Wavelength Assignment in WDM Rings to Minimize SONET ADMs

We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation complexity remains unknown, and the only known heuristic [6] which does not allow the splitting of lightpaths is problematic in both the algorithm itself and its performance analysis. We first prove the NP-completeness of this...

Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs

A 7/5 + ǫ Approximation Scheme for Minimizing the Number of ADMs in SONET Rings

SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation scheme in ...